graph coloring造句
例句与造句
- A min - conflict weight - learning algorithm for graph coloring problem
图着色问题的一个最小冲突权值学习算法 - In this paper , four types of graph coloring are discussed : dynamic coloring , incidence coloring , entire coloring and edge - face coloring of planar graphs
本文讨论了若干图类的四种不同的着色问题：动态着色、关联着色、平面图的完备着色和边面着色。 - By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm , a coloring - matching algorithm is proposed to solve the exam - arrangement problem
摘要将安排考试课程与分配班级考场分别化为图的染色与最大匹配问题，进而将两种算法融合并改进，使之适合于实际应用。 - In the second part , this paper does deeply research on how to use the memory system effectively . firstly , this paper proposes a modified register allocation via graph coloring to alleviate port conflicts
然后,面对分体寄存器文件可能产生端口冲突的新问题,提出了改进的基于图着色的寄存器分配法。 - Based on the combination of graph coloring model and the concept of spectrum quality grading , the proposed algorithm allocated the available spectrum to cognitive radio cells to meet demand maximally under qos guarantee
使用图论着色模型，结合频谱质量分级概念，根据小区内需求情况，该算法将网络中周期检测到的可用频谱分配给各个认知小区，最大化满足需求的同时，为业务提供服务质量保障。 - It's difficult to find graph coloring in a sentence. 用graph coloring造句挺难的
- The concept of the relaxed game chromatic number of a graph was firstly introduced by chou , wang and zhu in [ 1 ] . it connects the coloring problem with the game theory , so it is a important subject in the graph coloring theory and is studied by many researchers
图的松弛竞赛色数首先是由周，王，朱[ 1 ]提出来的，它把对策论和染色理论两个重要问题紧密联系在一起，从而使它在图染色理论中占有很重要的位置，并引起了众多专家人士的兴趣和关注。 - Then , the course of the development of register allocation strategy is illuminated in detail and a direct priority - based register allocation approach via the analysis and comparison of many improvements to the graph coloring strategy is proposed , it selects the split live range based on the priorities of the spilled live ranges not the priorities of the total candidate live ranges
然后,详细阐明了寄存器分配策略的演化历程,通过分析和比较基于图着色法的各种改进方案,从实现最优分配的角度,在chow和hennessy的寄存器分配方案的基础上提出一种基于直接优先级的寄存器分配策略,更直接、更具体地根据溢出活跃范围段的优先级决定切分。 - Based on the conclusion of organizing into trains and simulating the thoughts of dispatchers in district stations , this paper analyzes the features of time sets of shunting locomotives , constructs the reasonable graph model in the way of making out time sets , and converts it into the problem of graph coloring
在车流推算的基础上，从应用计算机模拟区段站调度员思维的角度出发，通过分析车列占用调车机车时区集合的特点，使用划分时间片的方法建立合适的调车机车安排的图论模型，将调机运用问题转化为顶点具有加权的图的k -着色问题。